NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
551	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics
552	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY All lectures will take place in Engineering Quad, Building EF, Seminar Room EF122 http://www.fpt.wikidot.com Tuesday, 3 0 M archMorning Session. Chair: Frances Rosamo Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:50:14 Computational complexity theory Michael Fellows Parameterized complexity NP-complete problems Vertex cover Bioinformatics Theoretical computer science Applied mathematics Mathematics
553	PCCR 2014 Report Serge Gaspers, UNSW Australia and NICTA PCCR 2014, the 2nd Workshop on the Parameterized Complexity of Computational Reasoning, took place in Vienna, Austria, 17-18 July 2014, as part of FLoC and the Vie Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-09-25 08:44:45 Computational complexity theory Parameterized complexity FO Connectivity SL NP-complete problems Theoretical computer science Applied mathematics Complexity classes
554	Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:22:16 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Complexity classes Tree decomposition Dominating set International Colloquium on Automata Languages and Programming Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
555	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics
556	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
557	Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:54 Network theory NP-complete problems Shortest path problem Steiner tree problem Routing algorithms Graph theory Theoretical computer science Mathematics
558	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
559	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
560	If you want to help us to build sudoku pages in your language translate text below. Your translation should be placed in the cells marked as (TranslationPlease send us translated form to . Thank Add to Reading List Source URL: sudoku.friko.net Language: English - Date: 2005-11-12 06:36:13 Sudoku NP-complete problems Games Sudoku algorithms Mathematics of Sudoku Mathematics Logic puzzles Recreational mathematics

UPDATE